Minimum Spanning Trees and Single Linkage Cluster Analysis
نویسنده
چکیده
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Blackwell Publishing and Royal Statistical Society are collaborating with JSTOR to digitize, preserve and extend access to Journal of the Royal Statistical Society. Series C (Applied Statistics).
منابع مشابه
Spanning Trees and bootstrap Reliability Estimation in Correlation-Based Networks
We introduce a new technique to associate a spanning tree to the average linkage cluster analysis. We term this tree as the Average Linkage Minimum Spanning Tree. We also introduce a technique to associate a value of reliability to links of correlation based graphs by using bootstrap replicas of data. Both techniques are applied to the portfolio of the 300 most capitalized stocks traded at New ...
متن کاملCorrelation, Hierarchies, and Networks in Financial Markets
We discuss methods to quantitatively investigate the properties of correlation matrices of a financial system. Correlation matrices play an important role in portfolio optimization and in several other quantitative descriptions of asset price dynamics in financial markets. Specifically, we discuss how to define and obtain hierarchical trees, correlation-based trees and networks from a correlati...
متن کاملScientific Method, Opinion, Phylogenetic Reconstruction, and Nectar-feeding Bats: A Response to Griffiths and Warner
not ensure that their joint solutions do not interact. This is clearly an undesirable property that is not shared by methods that form groups based only on the spatial relationships of OTUs that are relatively close together. Classifications based on minimum spanning trees (e.g., by using the single-link clustering method) and the UPGMA clustering method are obvious examples of methods that do ...
متن کاملMonotone Linkage Clustering and Quasi-Convex Set Functions
Greedily seriating objects one by one is implicitly employed in many heuristic clustering procedures, which can be described in terms of a linkage function measuring entity-to-set dissimilarities. A well-known clustering technique, single linkage clustering, can be considered as an example of the seriation procedures (actually, based on the minimum spanning tree construction) leading to the glo...
متن کاملAn Experimental Survey on Single Linkage Clustering
Clusters are useful to identify required object from the huge amount of datasets. There are lots of clustering methods, used to create clusters. Single linkage clustering method is an example of hierarchical agglomerative clustering which is used to merge objects in a cluster, based on minimum distance. In this paper we performed an experiment on two dimensional spaces where multiple objects ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008